Sparse Numerical Semigroups
نویسندگان
چکیده
We investigate the class of numerical semigroups verifying the property ρ i+1 − ρ i ≥ 2 for every two consecutive elements smaller than the conductor. These semigroups generalize Arf semigroups.
منابع مشابه
Numerical semigroups from open intervals
Consider an interval I ⊆ Q . Set S(I) = {m ∈ N : ∃ n ∈ N , mn ∈ I}. This turns out to be a numerical semigroup, and has been the subject of considerable recent investigation (see Chapter 4 of [2] for an introduction). Special cases include modular numerical semigroups (see [4]) where I = [mn , m n−1 ] (m,n ∈ N ), proportionally modular numerical semigroups (see [3]) where I = [mn , m n−s ] (m,n...
متن کاملNumerical semigroups with maximal embedding dimension
Even though the study and relevance of maximal embedding dimension numerical semigroups arises in a natural way among the other numerical semigroups, they have become specially renowned due to the existing applications to commutative algebra via their associated semigroup ring (see for instance [1, 5, 15, 16, 99, 100]). They are a source of examples of commutative rings with some maximal proper...
متن کاملSemigroups in which all strongly summable ultrafilters are sparse
We show that if (S,+) is a commutative semigroup which can be embedded in the circle group T, in particular if S = (N,+), then all nonprincipal, strongly summable ultrafilters on S are sparse and can be written as sums in βS only trivially. We develop a simple condition on a strongly summable ultrafilter which guarantees that it is sparse and show that this holds for many ultrafilters on semigr...
متن کاملPatterns on numerical semigroups
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of the whole set of numerical semigroups. In particular, all semigroups can be arranged in an infinite non-stabilizing ascending chain whose first step consists...
متن کاملChomp on numerical semigroups
We consider the two-player game chomp on posets associated to numerical semigroups and show that the analysis of strategies for chomp is strongly related to classical properties of semigroups. We characterize which player has a winning-strategy for symmetric semigroups, semigroups of maximal embedding dimension and several families of numerical semigroups generated by arithmetic sequences. Furt...
متن کامل